On generalized composed properties of generalized product graphs
نویسندگان
چکیده
<p>A property ℘ is defined to be a nonempty isomorphism-closed subclass of the class all finite simple graphs. A set <em>S</em> vertices graph <em>G</em> said ℘-set if <em>G</em>[<em>S</em>]∈ ℘. The maximum and minimum cardinalities are denoted by <em>M</em><sub>℘</sub>(<em>G</em>) <em>m</em><sub>℘</sub>(<em>G</em>), respectively. If such that its cardinality equals or we say an <em>M</em><sub>℘</sub>-set <em>m</em><sub>℘</sub>-set <em>G</em>, In this paper, not only define six types using concepts product generalized product, but also obtain <em>M</em><sub>℘</sub> <em>m</em><sub>℘</sub> graphs in each type characterize <em>M</em><sub>℘</sub>-set.</p>
منابع مشابه
Generalized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملGeneralized Cartesian Product of Graphs
Abstract—In graph theory, different types of products of two graphs had been studied, e.g., Cartesian product, Tensor product, Strong product, etc. In this paper we generalize the concept of Cartesian product of graphs.We define 2 Cartesian product and more generally r Cartesian product of two graphs. We study these product mainly for path graphs. We also discuss connectedness of the new graph.
متن کاملThe generalized hierarchical product of graphs
A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs turn out to be subgraphs of the Cartesian product of the corresponding factors. Thus, some well-known properties of this product, such as a good connectivity, reduced mean distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian journal of combinatorics
سال: 2022
ISSN: ['2541-2205']
DOI: https://doi.org/10.19184/ijc.2022.6.2.5